Performance Bounds and Suboptimal Policies for Multi-Period Investment
نویسندگان
چکیده
منابع مشابه
A Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem
Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, 77 Massachusetts Avenue, E40-147, Cambridge, MA 02139, USA Operations Research Center, Massachusetts Institute of Technology, 77 Massachusetts Avenue, E40-130, Cambridge, MA 02139, USA Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 77 Massachusetts...
متن کاملPerformance Bounds and Suboptimal Policies for Linear Stochastic Control via LMIs
In a recent paper, the authors showed how to compute performance bounds for infinite horizon stochastic control problems with linear system dynamics and arbitrary constraints, objective, and noise distribution. In this paper we extend these results to the finite-horizon case, with asymmetric costs and constraint sets. The method is based on bounding the objective with a general quadratic functi...
متن کاملScheduling policies for multi-period services
This paper discusses a multi-period service scheduling problem. In this problem, a set of customers is given who periodically require service over a finite time horizon. To satisfy the service demands, a set of operators is given, each with a fixed capacity in terms of the number of customers an operator can serve per period. The task is to determine for each customer the periods in which he wi...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولIndex Policies and Performance Bounds for Dynamic Selection Problems
We consider dynamic selection problems, where a decision maker repeatedly selects a set of items from a larger collection of available items. A classic example is the dynamic assortment problem, where a retailer chooses items to offer for sale subject to a display space constraint. The retailer may adjust the chosen assortment over time in response to the observed demand. These dynamic selectio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations and Trends® in Optimization
سال: 2014
ISSN: 2167-3888,2167-3918
DOI: 10.1561/2400000001